An Efficient Algorithm for Simulation of Transients in Large Power Systems

1171 G. Guardabassi and A. Sangiovanni-Vincentelli, “A Two Levels Algorithm for Tearing, “Memo no. ERL-M569, Electronics Research Laboratory, Umversity of California, Berkeley, Dec. 1975. G. Guardabassi, “Information structures in problem analysis,” in International Conference on Information Sciences and Systems, 1976. R. M. Karp, “Reducibility among combinatorial problems,” in Complexity of Computer Computations, R. E. Miller and J. W. Thatcher, Eds. New York: Plenum, 1972. G. Guardabassi, “A note on minimal essential sets,” IEEE Trans. on Circuit Theoy, vol. CT-15, Sept. 1968. L. K. Cheung and E. S. Kuh, “The bordered triangular matrix and minimum essential sets of a digraph,” IEEE Trans. Circuits and Systems, vol. CAS 21, pp. 633-639, Sept. 1974. A. Kevorkian and J. Snoek, “Decomposition in large scale systems: theory and applications in solving large sets of nonlinear simultaneous equations,” in Decomposition of Large Scale Problems, D. M. Himmemblau, Ed. Amsterdam, The Netherlands: North Holland, 1973. L. K. Cheung and R. S. Kuh, “Feedback vertex and edge sets of a digraph and applications to sparse matrices,” Memo no. ERL-M419, University.of California, Berkeley, Feb. 1974. Elettrotecnica ed Elettronica of the Politecnico di Milano, where he is presently Professor of Automatic Control. His research interests involve system and control theory and currently focus on periodic optimization and large scale systems theory and applications. He is currently an Associate Editor of the journal ‘Ricerche di Automatica’ and has been editor or co-editor of a number of books on tbpics of system and control theory, of the Proceedings of the 3rd IFAC Symposium on Sensitivity, Adaptivity and Optimality and of the IFAC Symposium on Large Scale Systems Theory and Applications. Dr. Guardabassi is a member ANIPLA and, since 1973, the Scientific Council of the National Automatica and Systems Group (a branch of the National Research Council).